翻訳と辞書
Words near each other
・ Fencing at the 1970 Summer Universiade
・ Fencing at the 1972 Summer Olympics
・ Fencing at the 1972 Summer Olympics – Men's foil
・ Fencing at the 1972 Summer Olympics – Men's sabre
・ Fencing at the 1972 Summer Olympics – Men's team foil
・ Fencing at the 1972 Summer Olympics – Men's team sabre
・ Fencing at the 1972 Summer Olympics – Men's team épée
・ Fencing at the 1972 Summer Olympics – Men's épée
・ Fencing at the 1972 Summer Olympics – Women's foil
・ Fencing at the 1972 Summer Olympics – Women's team foil
・ Fencing at the 1973 Summer Universiade
・ Fencing at the 1974 Asian Games
・ Fencing at the 1976 Summer Olympics
・ Fencibles United
・ Fencing
Fencing (computing)
・ Fencing at 2013 World Combat Games – Men's Epee Individual
・ Fencing at 2013 World Combat Games – Men's Foil Individual
・ Fencing at 2013 World Combat Games – Men's Sabre Individual
・ Fencing at 2013 World Combat Games – Women's Epee Individual
・ Fencing at 2013 World Combat Games – Women's Foil Individual
・ Fencing at 2013 World Combat Games – Women's Sabre Individual
・ Fencing at the 1896 Summer Olympics
・ Fencing at the 1896 Summer Olympics – Men's foil
・ Fencing at the 1896 Summer Olympics – Men's masters foil
・ Fencing at the 1896 Summer Olympics – Men's sabre
・ Fencing at the 1900 Summer Olympics
・ Fencing at the 1900 Summer Olympics – Men's amateurs-masters épée
・ Fencing at the 1900 Summer Olympics – Men's foil
・ Fencing at the 1900 Summer Olympics – Men's masters foil


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Fencing (computing) : ウィキペディア英語版
Fencing (computing)

Fencing is the process of isolating a node of a computer cluster or protecting shared resources when a node appears to be malfunctioning.〔〔''Sun Cluster environment: Sun Cluster 2.2'' by Enrique Vargas, Joseph Bianco, David Deeths 2001 ISBN page 58〕
As the number of nodes in a cluster increases, so does the likelihood that one of them may fail at some point. The failed node may have control over shared resources that need to be reclaimed and if the node is acting erratically, the rest of the system needs to be protected. Fencing may thus either disable the node, or disallow shared storage access, thus ensuring data integrity.
==Basic concepts==
A node fence (or I/O fence) is a virtual "fence" that separates nodes which may have access to a shared resource from nodes which must not. It may separate an active node from its backup. If the backup crosses the fence and, for example, tries to control the same disk array as the primary, a data hazard may occur. Mechanisms such as STONITH are designed to prevent this condition.
Isolating a node means ensuring that I/O can no longer be done from it. Fencing is typically done automatically, by cluster infrastructure such as shared disk file systems, in order to protect processes from other active nodes modifying the resources during node failures. Mechanisms to support fencing, such as the reserve/release mechanism of SCSI, have existed since at least 1985.〔(【引用サイトリンク】work=ANSI X3.131-1986 )
Fencing is required because it is impossible to distinguish between a real failure and a temporary hang. If the malfunctioning node is really down, then it cannot do any damage, so theoretically no action would be required (it could simply be brought back into the cluster with the usual join process). However, because there is a possibility that a malfunctioning node could itself consider the rest of the cluster to be the one that is malfunctioning, a split brain condition could ensue, and cause data corruption. Instead, the system has to assume the worst scenario and always fence in case of problems.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Fencing (computing)」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.